Extending generalized Whitney maps

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extending Generalized Whitney Maps

For metrizable continua, there exists the well-known notion of a Whitney map. If X is a nonempty, compact, and metric space, then any Whitney map for any closed subset of 2X can be extended to a Whitney map for 2X [3, 16.10 Theorem]. The main purpose of this paper is to prove some generalizations of this theorem.

متن کامل

Whitney Maps - a Non - Metric Case

It is shown that there is no Whitney map on the hyperspace 2x for nonmetrizable Hausdorff compact spaces X. Examples are presented of non-metrizable continua X which admit and ones which do not admit a Whitney map for C(X). Given a Hausdorff compact space X, we consider the space 2x of all non-empty compact subsets of X equipped with the Vietoris topology. Any subspace H (X) of the space 2x is ...

متن کامل

Extending Rational Maps

We investigate when a rational endomorphism of the Riemann sphere C extends to a mapping of the upper half-space H3 which is rational with respect to some measurable conformal structure. Such an extension has the property that it and all its iterates have uniformly bounded distortion. Such maps are called uniformly quasiregular. We show that, in the space of rational mappings of degree d, such ...

متن کامل

Extending Generalized Arc Consistency

Generalized arc consistency (GAC) is the most widely used local consistency in constraint programming. Several GAC algorithms for specific constraints, as well as generic algorithms that can be used on any constraint, have been proposed in the literature. Stronger local consistencies than GAC have also been studied but algorithms for such consistencies are generally considered too expensive. In...

متن کامل

Extending STL Maps Using LBSTs

Associative containers are basic generic classes of the C++ standard library. Access to the elements can be done by key or iterator, but not by rank. This paper presents a new implementation of the map class, which extends the Standard with the ability to support efficient direct access by rank without using extra space. This is achieved using LBST trees. This document reports on the algorithmi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Archivum Mathematicum

سال: 2017

ISSN: 0044-8753,1212-5059

DOI: 10.5817/am2017-2-65